runtime.addrRanges.ranges (field)

63 uses

	runtime (current package)
		mpagealloc.go#L468: 	for _, r := range p.inUse.ranges {
		mpagealloc_64bit.go#L168: 			need = need.subtract(addrRangeToSumAddrRange(l, p.inUse.ranges[inUseIndex-1]))
		mpagealloc_64bit.go#L170: 		if inUseIndex < len(p.inUse.ranges) {
		mpagealloc_64bit.go#L171: 			need = need.subtract(addrRangeToSumAddrRange(l, p.inUse.ranges[inUseIndex]))
		mranges.go#L244: 	ranges []addrRange
		mranges.go#L255: 	ranges := (*notInHeapSlice)(unsafe.Pointer(&a.ranges))
		mranges.go#L272: 	bot, top := 0, len(a.ranges)
		mranges.go#L275: 		if a.ranges[i].contains(base.addr()) {
		mranges.go#L280: 		if base.lessThan(a.ranges[i].base) {
		mranges.go#L298: 		if base.lessThan(a.ranges[i].base) {
		mranges.go#L313: 		return a.ranges[0].base.addr(), true
		mranges.go#L315: 	if a.ranges[i-1].contains(addr) {
		mranges.go#L318: 	if i < len(a.ranges) {
		mranges.go#L319: 		return a.ranges[i].base.addr(), true
		mranges.go#L330: 	return a.ranges[i-1].contains(addr)
		mranges.go#L355: 	coalescesDown := i > 0 && a.ranges[i-1].limit.equal(r.base)
		mranges.go#L356: 	coalescesUp := i < len(a.ranges) && r.limit.equal(a.ranges[i].base)
		mranges.go#L360: 		a.ranges[i-1].limit = a.ranges[i].limit
		mranges.go#L363: 		copy(a.ranges[i:], a.ranges[i+1:])
		mranges.go#L364: 		a.ranges = a.ranges[:len(a.ranges)-1]
		mranges.go#L368: 		a.ranges[i-1].limit = r.limit
		mranges.go#L372: 		a.ranges[i].base = r.base
		mranges.go#L376: 		if len(a.ranges)+1 > cap(a.ranges) {
		mranges.go#L381: 			oldRanges := a.ranges
		mranges.go#L382: 			ranges := (*notInHeapSlice)(unsafe.Pointer(&a.ranges))
		mranges.go#L388: 			copy(a.ranges[:i], oldRanges[:i])
		mranges.go#L389: 			copy(a.ranges[i+1:], oldRanges[i:])
		mranges.go#L391: 			a.ranges = a.ranges[:len(a.ranges)+1]
		mranges.go#L392: 			copy(a.ranges[i+1:], a.ranges[i:])
		mranges.go#L394: 		a.ranges[i] = r
		mranges.go#L403: 	if len(a.ranges) == 0 {
		mranges.go#L406: 	r := a.ranges[len(a.ranges)-1]
		mranges.go#L410: 		a.ranges[len(a.ranges)-1].limit = newEnd
		mranges.go#L414: 	a.ranges = a.ranges[:len(a.ranges)-1]
		mranges.go#L426: 		a.ranges = a.ranges[:0]
		mranges.go#L430: 	for _, r := range a.ranges[pivot:] {
		mranges.go#L433: 	if r := a.ranges[pivot-1]; r.contains(addr) {
		mranges.go#L440: 			a.ranges[pivot-1] = r
		mranges.go#L443: 	a.ranges = a.ranges[:pivot]
		mranges.go#L450: 	if len(a.ranges) > cap(b.ranges) {
		mranges.go#L452: 		ranges := (*notInHeapSlice)(unsafe.Pointer(&b.ranges))
		mranges.go#L454: 		ranges.cap = cap(a.ranges)
		mranges.go#L457: 	b.ranges = b.ranges[:len(a.ranges)]
		mranges.go#L459: 	copy(b.ranges, a.ranges)